Strong reductions for extended formulations
نویسندگان
چکیده
منابع مشابه
Strong Reductions for Extended Formulations
We generalize the reduction mechanism for linear programming problems and semidefinite programming problems from [BPZ15] in two ways (1) relaxing the requirement of affineness, and (2) extending to fractional optimization problems. As applicationswe provide several newLP-hardness and SDP-hardness results, e.g., for theSparsestCut problem, the BalancedSeparator problem, the MaxCut problem and th...
متن کاملStrong formulations for mixed integer programs: valid inequalities and extended formulations
We examine progress over the last fifteen years in finding strong valid inequalities and tight extended formulations for simple mixed integer sets lying both on the “easy” and “hard” sides of the complexity frontier. Most progress has been made in studying sets arising from knapsack and single node flow sets, and a variety of sets motivated by different lot-sizing models. We conclude by citing ...
متن کاملExtended formulations for polygons
The extension complexity of a polytope P is the smallest integer k such that P is the projection of a polytope Q with k facets. We study the extension complexity of n-gons in the plane. First, we give a new proof that the extension complexity of regular n-gons is O(logn), a result originating from work by Ben-Tal and Nemirovski (Math. Oper. Res. 26(2), 193–205, 2001). Our proof easily generaliz...
متن کاملSimplicity and Strong Reductions
A set is called NP-simple if it lies in NP, and its complement is infinite, and does not contain any infinite subsets in NP. Hartmanis, Li and Yesha [HLY86] proved that no set which is hard for NP under many-one (Karp) reductions is NP-simple unless NP ∩ coNP ⊆ SUBEXP. However, we can exhibit a relativized world in which there is an NP-simple set that is complete under Turing (Cook) reductions,...
متن کاملExtended Formulations for Sparsity Matroids
We show the existence of a polynomial-size extended formulation for the base polytope of a (k, l)-sparsity matroid. For an undirected graph G = (V,E), the size of the formulation is O(|V ||E|) when k ≥ l and O(|V ||E|) when k ≤ l. To this end, we employ the technique developed by Faenza et al. recently that uses a randomized communication protocol.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2018
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-018-1316-y